On the extensibility of Diophantine triples {k-1, k+1, 4k} for Gaussian integers
نویسندگان
چکیده
منابع مشابه
On the family of Diophantine triples { k − 1 , k + 1 , 16 k 3 − 4 k }
It is proven that if k ≥ 2 is an integer and d is a positive integer such that the product of any two distinct elements of the set {k − 1, k + 1, 16k − 4k, d} increased by 1 is a perfect square, then d = 4k or d = 64k−48k+8k. Together with a recent result of Fujita, this shows that all Diophantine quadruples of the form {k − 1, k + 1, c, d} are regular.
متن کاملOn the Sums ∞ K=−∞ (4k + 1)
The sum in the title is a rational multiple of π for all integers n = 2, 3, 4, . . . for which the sum converges absolutely. This is equivalent to a celebrated theorem of Euler. Of the many proofs that have appeared since Euler, a simple one was discovered only recently by Calabi [4]: the sum is written as a definite integral over the unit n-cube, then transformed into the volume of a polytope ...
متن کاملThe Diophantine Equation x4 ± y4 = iz2 in Gaussian Integers
The Diophantine equation x4 ± y4 = z2, where x, y and z are integers was studied by Fermat, who proved that there exist no nontrivial solutions. Fermat proved this using the infinite descent method, proving that if a solution can be found, then there exists a smaller solution (see for example [1], Proposition 6.5.3). This was the first particular case proven of Fermat’s Last Theorem (which was ...
متن کاملBalancing Diophantine triples with distance 1
For a positive real number w let the Balancing distance ‖w‖B be the distance from w to the closest Balancing number. The Balancing sequence is defined by the initial values B0 = 0, B1 = 1 and by the binary recurrence relation Bn+2 = 6Bn+1 − Bn , n ≥ 0. In this paper, we show that there exist only one positive integer triple (a, b, c) such that the Balancing distances ‖ab‖B , ‖ac‖B and ‖bc‖B all...
متن کاملSome Fourth Degree Diophantine Equations in Gaussian Integers
For certain choices of the coefficients a, b, c the solutions of the Diophantine equation ax+by = cz in Gaussian integers satisfy xy = 0.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Glasnik Matematicki
سال: 2008
ISSN: 0017-095X
DOI: 10.3336/gm.43.2.04